On subword decomposition and balanced polynomials
نویسندگان
چکیده
منابع مشابه
On Subword Decomposition and Balanced Polynomials
Let H(x) be a monic polynomial over a finite field F = GF(q). Denote by Na(n) the number of coefficients in Hn which are equal to an element a ∈ F, and by G the set of elements a ∈ F× such that Na(n) > 0 for some n. we study the relationship between the numbers (Na(n))a∈G and the patterns in the base q representation of n. This enables us to prove that for “most” n’s we have Na(n) ≈ Nb(n), a, b...
متن کاملRemarks on Orthogonal Polynomials and Balanced Realizations
Given a proper antistable rational transfer function g, a balanced realization of g is constructed as a matrix representation of the abstract shift realization introduced by Fuhrmann (1976). The required basis is constructed as a union of sets of polynomials orthogonal with respect to weights given by the squares of the absolute values of minimal degree Schmidt vectors of the corresponding Hank...
متن کاملOn the balanced decomposition number
A balanced coloring of a graph G means a triple {P1, P2,X} of mutually disjoint subsets of the vertex-set V (G) such that V (G) = P1⊎P2⊎X and |P1| = |P2|. A balanced decomposition associated with the balanced coloring V (G) = P1⊎P2⊎X of G is defined as a partition of V (G) = V1⊎· · ·⊎Vr (for some r) such that, for every i ∈ {1, · · · , r}, the subgraphG[Vi] of G is connected and |Vi∩P1| = |Vi∩P...
متن کاملBalanced Labellings and Schubert Polynomials
We study balanced labellings of diagrams representing the inversions in a permutation. These are known to be natural encodings of reduced decompositions of permutations w 2 n , and we show that they also give combinatorial descriptions of both the Stanley symmetric functions F w and and the Schubert polynomial S w associated with w. Furthermore, they lead to an explicit basis for the Schubert m...
متن کاملFurther Results on the Balanced Decomposition Number
A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the following property: For any balanced colouring of G, there is a partition V (G) = V1 ∪̇ · · · ∪̇Vr such that, for every 1 ≤ i ≤ r, Vi induces a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2007
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2006.07.007